Variations on Sweep Algorithms : e cient computation of extended viewsheds and class intervals
نویسنده
چکیده
Two novel applications of the plane sweep paradigm are demonstrated, namely, for the computation of extended viewsheds on gridded DEMs and for class interval selection on TIN-based DEMs. In both cases, the e ciency of the plane sweep algorithm is signi cantly better than a straightforward approach. The algorithms are presented by rst giving the plane sweep method as a general approach that requires some ingredients to make it work well. Adaptations to minimize additional storage use are also presented.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملExperiments on the Practical I/o Eeciency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep Experiments on the Practical I/o Eeciency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep
We present an extensive experimental study comparing the performance of four algorithms for the following orthogonal segment intersection problem: given a set of horizontal and vertical line segments in the plane, report all intersecting horizontal-vertical pairs. The problem has important applications in VLSI layout and graphics, which are large-scale in nature. The algorithms under evaluation...
متن کاملcient Perturbations for Handling Geometric Degeneracies
This article de nes input perturbations so that an algorithm designed under certain restrictions on the input can execute on arbitrary instances. A syntactic de nition of perturbations is proposed and certain properties are speci ed under which an algorithm executed on perturbed input produces an output from which the exact answer can be recovered. A general framework is adopted for linear pert...
متن کاملExperiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep
We present an extensive experimental study comparing the performance of four algorithms for the following orthogonal segment intersection problem: given a set of horizontal and vertical line segments in the plane, report all intersecting horizontal-vertical pairs. The problem has important applications in VLSI layout and graphics, which are large-scale in nature. The algorithms under evaluation...
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کامل